#include <bits/stdc++.h>
using namespace std;
using LL = long long;
// #define zerol
#define FOR(i, x, y) for (decay<decltype(y)>::type i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) for (decay<decltype(x)>::type i = (x), _##i = (y); i > _##i; --i)
#ifdef zerol
#define dbg(x...) do { cout << "\033[32;1m" << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cout << a << ' '; err(x...); }
#else
#define dbg(...)
#endif
 
typedef long double LD;
 
const int N = 505;
 
LD s[N];
 
LD C[N][N];
int a[N];
int n, k;
 
 
LD ans[N];
int main() {
    C[0][0] = 1;
    for (int i=1; i<N; ++i) {
        C[i][0] = C[i][i] = 1;
        for (int j=1; j<i; ++j)
            C[i][j] = (C[i-1][j-1] + C[i-1][j]);
    }
    scanf("%d%d", &n, &k);
    
    for (int i=0; i<n; ++i) {
        scanf("%LF", &s[i]);
    }
    if (k == 1) {
        const LD f = 1.0 / n;
        for (int i=0; i<n; ++i)
            printf("%.7Lf%c", f*100, i==n-1? '\n':' ');
        return 0;
    }
    const LD B = C[n][k];
    for (int i=0; i<n; ++i) {
        LD f = 0;
        for (int j=k; j<=n; ++j) {
            f += s[(i+j)%n]/100.0;
        }
        LD A = 0;
        for (int j=k; j<=n; ++j) {
            A += C[j-2][k-2] * f;
            dbg(j, C[j-2][k-2], f, i);
            f -= s[(i+j)%n]/100.0;
        }
        ans[i] = A / B * 100;
    }
 
    for (int i=0; i<n; ++i)
        printf("%.7Lf%c", ans[i], i==n-1? '\n':' ');
 
    
 
    return 0;
}